Timing Matters: Tackling Intractable Problems

نویسندگان

  • George F. Hurlburt
  • Jeffrey M. Voas
چکیده

I f you were at least five years old on 20 July 1969, then you know exactly where you were when Neil Armstrong became the first human to walk on the moon. With that act, America won the space race. Safely going to and returning from the moon was a long-term goal that required solving a myriad of related technical problems. It took concerted resolve to overcome this heretofore intractable scientific problem of huge proportion, exemplifying James A. Michener’s astute observation: “There are no insoluble problems, only time-consuming ones.” Taken collectively, Armstrong’s trip to the moon is a case study of applying the right solutions to the right problems at the right time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Marginal sequential Monte Carlo for doubly intractable models

Bayesian inference for models that have an intractable partition function is known as a doubly intractable problem, where standard Monte Carlo methods are not applicable. The past decade has seen the development of auxiliary variable Monte Carlo techniques (Møller et al., 2006; Murray et al., 2006) for tackling this problem; these approaches being members of the more general class of pseudo-mar...

متن کامل

Tackling the Emerging Problems in Quantum Computer Architecture

Quantum computer architecture is a young field of study, and there are many challenges looking forward. We present here several open problems facing the development of large-scale quantum computers. In particular, we examine issues regarding the organization and layout of a quantum computer, the interface with classical computation, and the necessary tradeoffs between engineering resources. Mor...

متن کامل

Pareto Frontier Learning with Expensive Correlated Objectives

There has been a surge of research interest in developing tools and analysis for Bayesian optimization, the task of finding the global maximizer of an unknown, expensive function through sequential evaluation using Bayesian decision theory. However, many interesting problems involve optimizing multiple, expensive to evaluate objectives simultaneously, and relatively little research has addresse...

متن کامل

A Monte Carlo Metropolis-Hastings Algorithm for Sampling from Distributions with Intractable Normalizing Constants

Simulating from distributions with intractable normalizing constants has been a long-standing problem in machine learning. In this letter, we propose a new algorithm, the Monte Carlo Metropolis-Hastings (MCMH) algorithm, for tackling this problem. The MCMH algorithm is a Monte Carlo version of the Metropolis-Hastings algorithm. It replaces the unknown normalizing constant ratio by a Monte Carlo...

متن کامل

Innovation timing games: a general framework with applications

We offer a new algorithm for analyzing innovation timing games. Its main advantage over the traditional approach is that it applies to problems that had previously been intractable. We use the algorithm to examine two classical innovation problems. We find that the competition takes the form of a waiting game with a second-mover advantage either for any level of R&D costs (process innovation) o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IT Professional

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2011